When you purchase through links in our articles, we may earn a small commission. MasterClass is 50% off today. Until May 10th, MasterClass annual plans start at $60/year. It's great for casual learners who want high-quality, entertaining courses from big names. With the job market being what it is, there's never been a better time to learn new skills (or brush up on old ones).

Will A.I. Make College Obsolete? More and more people may decide that its stamp of approval isn't worth the cost. A few weeks ago, while I was dealing with taxes, it occurred to me that the money my wife and I were putting away in a college fund for our children might be better used somewhere else. This wasn't a novel musing, but it felt particularly pressing as I watched my account balance go down, a portion of its resources funnelled into something that can't be touched for at least the next nine years. When my nine-year-old daughter graduates from high school, in 2035, I asked myself, will the landscape of higher education look the way that it does now?

This Indigenous Language Survived Russian Occupation. YouTube's search and recommendation algorithms are driving children to Russian-language content even when they seek out videos in Kyrgyz, creating a cultural shift that concerns some parents. When anthropology researcher Ashley McDermott was doing fieldwork in Kyrgyzstan a few years ago, she says many people voiced the same concern: Children were losing touch with their indigenous language. The Central Asian country of 7 million people was under Russian control for a century until 1991, but Kyrgyz (pronounced kur-giz) survived and remains widely spoken among adults. McDermott, a doctoral student at the University of Michigan, says she also heard that some kids in rural villages where Kyrgyz dominated had spontaneously learned to speak Russian.

This material may not be published, broadcast, rewritten, or redistributed. Quotes displayed in real-time or delayed by at least 15 minutes. Market data provided by Factset . Powered and implemented by FactSet Digital Solutions . Mutual Fund and ETF data provided by LSEG .

What Will It Take to Get A.I. Out of Schools? The tech world assumes that A.I.-aided education is necessary and inevitable. A growing number of parents, educators, and cognitive scientists say the opposite. I don't like A.I., and I am raising my children not to like it. I've been telling them for years now that chatbots are manipulative and dangerous, that A.I.-image generators are loosening our collective grip on reality, that large language models are built atop industrial-scale intellectual-property theft. At times, I find myself speaking with my kids about A.I. in the same terms that we might discuss a creepy neighbor who lives down the block: avoid eye contact, cross the street when you walk past his house, and, when in doubt, call on a trusted adult. Yes, I, too, have suspected that the creepy neighbor walks on cloven hooves inside his Yeezy Boosts, but he probably isn't going anywhere--in fact, he keeps buying up properties around town--so just try your best not to engage. Somehow, I was not prepared for the creepy neighbor to start hanging around my kids' schools; somehow, I thought we had until high school.

The ninth edition of the Artificial Intelligence Index Report was published on 13 April 2026. Released on a yearly basis, the aim of the document is to provide readers with accurate, rigorously validated, and globally-sourced data to give insights into the progress of AI and its potential impact on society. The 2026 AI Index Report comprises nine chapters, covering: research and development, technical performance, responsible AI, economy, science, medicine, education, policy and governance, and public opinion. AI capability is accelerating and reaching more people than ever. Model performance continues to improve against benchmarks, and 80% of university students now use generative AI.

Things to Do in L.A. Tap to enable a layout that focuses on the article. Students with computers participate in a summer program at Canoga Park High School in 2022. This is read by an automated voice. Please report any issues or inconsistencies here . Los Angeles Unified is poised to reverse years of promoting classroom technology with restrictions on student screen time.

Smooth functions on graphs have wide applications in manifold and semi-supervised learning. In this paper, we study a bandit problem where the payoffs of arms are smooth on a graph. This framework is suitable for solving online learning problems that involve graphs, such as content-based recommendation. In this problem, each item we can recommend is a node and its expected rating is similar to its neighbors. The goal is to recommend items that have high expected ratings. We aim for the algorithms where the cumulative regret with respect to the optimal policy would not scale poorly with the number of nodes. In particular, we introduce the notion of an effective dimension, which is small in real-world graphs, and propose two algorithms for solving our problem that scale linearly and sublinearly in this dimension. Our experiments on real-world content recommendation problem show that a good estimator of user preferences for thousands of items can be learned from just tens of nodes evaluations.

We derive a robust update rule for the online infinite hidden Markov model (iHMM) for when the streaming data contains outliers and the model is misspecified. Leveraging recent advances in generalised Bayesian inference, we define robustness via the posterior influence function (PIF), and provide conditions under which the online iHMM has bounded PIF. Imposing robustness inevitably induces an adaptation lag for regime switching. Our method, which is called Batched Robust iHMM (BR-iHMM), balances adaptivity and robustness with two additional tunable parameters. Across limit order book data, hourly electricity demand, and a synthetic high-dimensional linear system, BR-iHMM reduces one-step-ahead forecasting error by up to 67% relative to competing online Bayesian methods. Together with theoretical guarantees of bounded PIF, our results highlight the practicality of our approach for both forecasting and interpretable online learning.

We propose a new partial-observability model for online learning problems where the learner, besides its own loss, also observes some noisy feedback about the other actions, depending on the underlying structure of the problem. We represent this structure by a weighted directed graph, where the edge weights are related to the quality of the feedback shared by the connected nodes. Our main contribution is an efficient algorithm that guarantees a regret of $\widetilde{O}(\sqrt{α^* T})$ after $T$ rounds, where $α^*$ is a novel graph property that we call the effective independence number. Our algorithm is completely parameter-free and does not require knowledge (or even estimation) of $α^*$. For the special case of binary edge weights, our setting reduces to the partial-observability models of Mannor and Shamir (2011) and Alon et al. (2013) and our algorithm recovers the near-optimal regret bounds.